A Homotopic/Factorization Process for Toeplitz-like Matrices with Newton’s/Conjugate Gradient Stages
نویسنده
چکیده
We modify our earlier homotopic process for iterative inversion of Toeplitz and Toeplitz-like matrices to improve the choice of the initial approximate inverses at every homotopic step. This enables us to control the condition of the auxiliary matrices and to accelerate convergence substantially. The algorithm extends our older approach where the input matrix was factorized into the product of better conditioned factors, which are more readily invertible with the conjugate gradient algorithm. Now we study a similar factorization as a homotopic process and use the option of inverting all or some factors by applying Newton’s iteration where initial approximate inverses are readily available.
منابع مشابه
TR-2004014: A Homotopic/Factorization Process for Toeplitz-like Matrices with Newton's/Conjugate Gradient Stages
متن کامل
A Total Least Squares Methodfor Toeplitz
A Newton method to solve total least squares problems for Toeplitz systems of equations is considered. When coupled with a bisection scheme, which is based on an eecient algorithm for factoring Toeplitz matrices, global convergence can be guaranteed. Circulant and approximate factorization preconditioners are proposed to speed convergence when a conjugate gradient method is used to solve linear...
متن کاملBIT Submitted May 1997, Revised February 1998. A TOTAL LEAST SQUARES METHOD FOR TOEPLITZ SYSTEMS OF EQUATIONS
A Newton method to solve total least squares problems for Toeplitz systems of equations is considered. When coupled with a bisection scheme, which is based on an eecient algorithm for factoring Toeplitz matrices, global convergence can be guaranteed. Circulant and approximate factorization preconditioners are proposed to speed convergence when a conjugate gradient method is used to solve linear...
متن کاملA Survey of Preconditioners for Ill-Conditioned Toeplitz Systems
In this paper, we survey some of latest developments in using preconditioned conjugate gradient methods for solving mildly ill-conditioned Toeplitz systems where the condition numbers of the systems grow like O(n) for some > 0. This corresponds to Toeplitz matrices generated by functions having zeros of order. Because of the ill-conditioning, the number of iterations required for convergence in...
متن کاملIterative Methods for Toeplitz-like Matrices
In this paper we will give a survey on iterative methods for solving linear equations with Toeplitz matrices. We introduce a new class of Toeplitz matrices for which clustering of eigenvalues and singular values can be proved. We consider optimal (ω)circulant preconditioners as a generalization of the circulant preconditioner. For positive definite Toeplitz matrices, especially in the real case...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004